Asynchronous Tree-Based Multicasting in Wormhole-Switched MINs

نویسندگان

  • Vara Varavithya
  • Prasant Mohapatra
چکیده

Multicast operation is an important operation in multicomputer communication systems and can be used to support several collective communication operations. A signiicant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose an asynchronous tree-based multicasting (ATBM) technique for multistage interconnec-tion networks (MINs). The deadlock issues in tree-based multicasting in MINs are analyzed rst to examine the main cause of deadlocks. An ATBM framework is developed in which deadlocks are prevented by serializing the initiations of tree operations that have a potential to create deadlocks. These tree operations are identiied through a grouping algorithm. The ATBM approach is not only simple to implement but also provides good communication performance using minimal overheads in terms of additional hardware requirements and synchronization delay. Using the ATBM framework, algorithms are developed for both unidirectional and bidirectional multistage interconnection networks. The performances of the proposed algorithms are evaluated through simulation experiments. The results indicate that the proposed hardware-based ATBM scheme reduces the communication latency when compared to the software multicasting approach proposed earlier.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree-based Multicasting on Wormhole Routed Multistage Interconnection Networks 1

Multicast operation is an important operation in multicomputer communication systems and can be used to support several other collective communication operations. A signi cant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose a tree based multicasting algorithm for Multistage Interconnection Networks (MIN). We rst analyze...

متن کامل

Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks

In this paper, we propose a tree-based multicasting algorithm for Multistage Interconnection Networks. We rst analyze the necessary conditions for deadlocks in MINs. Based on these observations, an asyn-chronous tree-based multicasting algorithm is developed in which deadlocks are prevented by serializing the initiations of branching operations that have potential for creating deadlocks. The se...

متن کامل

Tree-Based Multicasting in Wormhole-Routed Irregular Topologies

A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number of destinations using only a single startup phase. In contrast to existing tree-based schemes, this algorithm applies to all interconnection topologies, requires only xed-sized input bu ers that are independent of max...

متن کامل

Performance Evaluation of Switch-Based Wormhole Networks

Multistage interconnection networks (MINs) are a popular class of switch-based network architectures for constructing scalable parallel computers. Four wormhole MINs built from k ¥ k switches, where k = 2 j for some j, are considered in this paper: traditional MINs (TMINs), dilated MINs (DMINs), MINs with virtual channels (VMINs), and bidirectional MINs (BMINs). The first three MINs are unidire...

متن کامل

Tree-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks with Hamiltonian Path

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In our previous work on wormhole star graph networks routing, we proposed a path-base...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Parallel Distrib. Syst.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1999